Control Algorithms for Self-Reconfigurable Robots

نویسنده

  • Sam Slee
چکیده

The abilities of modern computers has provided immense power and flexibility for modeling things in the virtual realm. Yet the robotic systems through which computers can interact with the physical world are far more limited. Robots are often designed for limited, specific tasks with little chance of extending to different abilities. Self-reconfigurable robots are systems composed of many small modules that can autonomously reconfigure the shape and structure of their system. The versatility of such systems gives a way to extend the flexible power of computers from the virtual realm to the physical world. While promising, development of self-reconfigurable robotics is still in the early stages and large challenges remain in designing the physical modules and especially in designing the algorithms that will control them. This project will seek to develop control algorithms for self-reconfigurable robots that extend and improve upon those currently used in the field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimaental Evaluation of a Distributed Control System for Chain-type Self-reconfigurable Robots

Self-reconfigurable robots are an instance of complex systems that can autonomously rearrange their modules. Recently, there has been a great interest in using these robots in different domains such as reconnaissance, rescue missions, and space applications for their versatility, fault tolerance, low cost of reproducibility, and efficiency in rough terrains. Because of their distributed nature,...

متن کامل

Generic Decentralized Control for a Class of Self-Reconfigurable Robots

Previous work on self-reconfiguring modular robots has concentrated primarily on hardware and reconfiguration algorithms for particular systems. In this paper, we introduce a new type of generic locomotion algorithm for self-reconfigurable robots. The algorithms presented here are inspired by cellular automata, using geometric rules to control module actions. The actuation model used is a gener...

متن کامل

Generic Decentralized Control for Lattice-Based Self-Reconfigurable Robots

Previous work on self-reconfiguring modular robots has concentrated primarily on designing hardware and developing reconfiguration algorithms tied to specific hardware systems. In this paper, we introduce a generic model for lattice-based self-reconfigurable robots and present several generic locomotion algorithms that use this model. The algorithms presented here are inspired by cellular autom...

متن کامل

Implementing Flexible Parallelism for Modular Self-reconfigurable Robots

Modular self-reconfigurable robots are drawing increasing interest due to their nature as a versatile, resilient and potentially costeffective tool. Programming modular self-reconfigurable robots is however complicated by the need for closely coordinating the actions of each module with those of its neighbors. In this paper, we investigate the need for a flexible set of concurrency primitives w...

متن کامل

Using Modular Self-Reconfiguring Robots for Locomotion

We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigurable robots. We illustrate the application of this result on two self-reconfigurable robot systems we designed and built in our lab: the robotic molecule and the atom. We describe the modules and our locomotion experim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006